Constructing SCI-configurations that are free from deadlocks

We study the problem of possible deadlocks in an SCI-interconnect. We show that it is possible to automatically decide whether an SCI-configuration is prone to deadlocks, and we indicate an algorithm that checks this effectively by searching a graph for cycles. Then we present another algorithm that automatically modifies a deadlocking configuration, such that it becomes deadlock free. We apply the algorithms to two examples, one small and one of significant size. The larger example demonstrate that the support of algorithms like this is necessary in order to effectively configure complex SCInetworks.